Complementary pivot theory of mathematical programming
نویسندگان
چکیده
منابع مشابه
Complementary Pivot Theory of Mathematical Programming
1 The fundamental problem can be extended from p sets each consisting of a pair of variables only one of which can bc nonbasic to k sets of several variables each, only one of which can be nonbasic. To be specific, consider a system w = q f Nz, zw > 0, z > 0, where N is a p x k matrix (k < p) and the variables wl, , zu@ are partitioned into k nonempty sets SI, I = I, ., k. Let TI = SJ IJ {q}, I...
متن کاملSemistochastic decomposition scheme in mathematical programming and game theory
This work deals with the optimization problem sup inf S(x, y), which plays, undoubtedly xeX yeY a crucial part in mathematical programming and game theory. On the basis of probability theory, a solving approach — semistochastic decomposition is proposed. This method is finite with probability 1 without any hypothesis about convexity or differentiability as it is usually required in traditional ...
متن کاملDuality Theory in Fuzzy Mathematical Programming Problems with Fuzzy Coefficients
Abstract In this paper, the notions of subgradmnt, subdifferentla[, and differential with respect to convex fuzzy mappings are investigated, whmh provides the basis for the fuzzy extremum problem theory We consider the problems of minimizing or maximizing a convex fuzzy mapping over a convex set and develop the necessary and/or sufficient optlmahty conditions. Furthermore, the concept of saddle...
متن کاملMathematical solution of multilevel fractional programming problem with fuzzy goal programming approach
In this paper, we show a procedure for solving multilevel fractional programming problems in a large hierarchical decentralized organization using fuzzy goal programming approach. In the proposed method, the tolerance membership functions for the fuzzily described numerator and denominator part of the objective functions of all levels as well as the control vectors of the higher level decision ...
متن کاملClosing the gap in pivot methods for linear programming
We propose pivot methods that solve linear programs by trying to close the duality gap from both ends. The first method maintains a set B of at most three bases, each of a different type, in each iteration: a primal feasible basis Bp, a dual feasible basis Bd and a primal-and-dual infeasible basis Bi. From each B ∈ B, it evaluates the primal and dual feasibility of all primal and dual pivots to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1968
ISSN: 0024-3795
DOI: 10.1016/0024-3795(68)90052-9